A novel discrete Rat swarm optimization (DRSO) algorithm for solving the traveling salesman problem
نویسندگان
چکیده
Metaheuristics are often used to find solutions real and complex problems. These algorithms can solve optimization problems provide close the global optimum in an acceptable reasonable time. In this paper, we will present a new bio-inspired metaheuristic based on natural chasing attacking behaviors of rats nature, called Rat swarm optimizer. Which has given good results solving several continuous problems, adapted it discrete, NP-hard, classical problem that is traveling salesman (TSP) while respecting behavior rats. To test efficiency adaptation our proposal, applied rat (RSO) algorithm some reference instances TSPLIB. The obtained show performance proposed method (TSP).
منابع مشابه
Solving the Multiple Traveling Salesman Problem by a Novel Meta-heuristic Algorithm
The multiple traveling salesman problem (MTSP) is a generalization of the famous traveling salesman problem (TSP), where more than one salesman is used in the solution. Although the MTSP is a typical kind of computationally complex combinatorial optimization problem, it can be extended to a wide variety of routing problems. This paper presents an efficient and evolutionary optimization algorith...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولParticle Swarm Optimization Algorithm for the Traveling Salesman Problem
Particle swarm optimization, PSO, is an evolutionary computation technique inspired in the behavior of bird flocks. PSO algorithms were first introduced by Kennedy & Eberhart (1995) for optimizing continuous nonlinear functions. The fundamentals of this metaheuristic approach rely on researches where the movements of social creatures were simulated by computers (Reeves, 1983; Reynolds, 1987; He...
متن کاملDiscrete Cat Swarm Optimization to Resolve the Traveling Salesman Problem
This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu and Tsai for optimization problems in the continuous case. To solve TSP, which is a discrete problem, we will describe the various operators and operations performed in two different modes of this algorithm, which is th...
متن کاملA reactive bone route algorithm for solving the traveling salesman problem
The traveling salesman problem (TSP) is a well-known optimization problem in graph theory, as well as in operations research that has nowadays received much attention because of its practical applications in industrial and service problems. In this problem, a salesman starts to move from an arbitrary place called depot and after visits all of the nodes, finally comes back to the depot. The obje...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Decision Making
سال: 2022
ISSN: ['2560-6018', '2620-0104']
DOI: https://doi.org/10.31181/dmame0318062022m